(p − 1)(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective
نویسندگان
چکیده
منابع مشابه
L p compression , traveling salesmen , and stable walks
We show that if H is a group of polynomial growth whose growth rate is at least quadratic then the Lp compression of the wreath product Z oH equals max { 1 p , 1 2 } . We also show that the Lp compression of Z oZ equals max { p 2p−1 , 2 3 } and the Lp compression of (Z oZ)0 (the zero section of Z oZ, equipped with the metric induced from Z o Z) equals max { p+1 2p , 3 4 } . The fact that the Hi...
متن کاملAn Approximate Algorithm Combining P Systems and Ant Colony Optimization for Traveling Salesman Problems
This paper proposes an approximate optimization algorithm combining P systems with ant colony optimization, called ACOPS, to solve traveling salesman problems, which are well-known and extensively studied NP-complete combinatorial optimization problems. ACOPS uses the pheromone model and pheromone update rules defined by ant colony optimization algorithms, and the hierarchical membrane structur...
متن کاملNumerical mixed-integer optimal control and motorized traveling salesmen problems
A general approach for the numerical solution of hybrid, mixed-integer optimal control problems is presented. In an outer level iteration a branch-and-bound procedure is applied to search the entire feasible discrete variable space. An inner level iteration contains for each actual value of the discrete variable a continuous nonlinear optimal control problem with its nonlinear dynamics defined ...
متن کاملFinding Pareto-Optimal Set by Merging Attractors for a Bi-objective Traveling Salesmen Problem
This paper presents a new search procedure to tackle multi-objective traveling salesman problem (TSP). This procedure constructs the solution attractor for each of the objectives respectively. Each attractor contains the best solutions found for the corresponding objective. Then, these attractors are merged to find the Pareto-optimal solutions. The goal of this procedure is not only to generate...
متن کاملApproximate Solving of Large p-Median Problems
This paper deals with an approximate approach to the p-median problem. Large instances of the p-median problem can be often met when a real public service system is designed and the discomfort of its customers is minimized. If a large instance of the p-median problem is described by a location-allocation model, then the size of a model often exceeds the acceptable limit for available optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)89161-5